A Parametric Copula Approach for Modelling Shortest-Path Trees in Telecommunication Networks
نویسندگان
چکیده
Abstract. We extend the Stochastic Subscriber Line Model by the introduction of shortest-path trees which are obtained by splitting up the segment system of the typical serving zone at its crossings and endings. Due to reasons in the complex field of cost and capacity estimation in telecommunication networks, it is desirable to gain knowledge about distributional properties of the branches of these trees. The present paper shows how to obtain parametric approximation formulas for the univariate density functions of the lengths of the two main branches in shortest-path trees. Besides, we derive a joint bivariate distribution for the lengths of these branches by means of copula functions, i.e., we give a parametric composition formula of the marginals. These approximative parametric representation formulas can be used in order to prevent time consuming computer experiments.
منابع مشابه
Joint distributions for total lengths of shortest-path trees in telecommunication networks
Shortest-path trees play an important role in the field of optimising fixed-access telecommunication networks with respect to costs and capacities. Distributional properties of the corresponding two half-trees originating from the root of such a tree are of special interest for engineers. In the present paper, we derive parametric approximation formulas for the marginal density functions of the...
متن کاملParametric Modelling of Sparse Random Trees Using 3d Copulas
We provide a parametric modelling approach suitable for various kinds of hierarchical networks based on random geometric graphs. In these networks, we have two kinds of components, so-called high-level components (HLC) and low-level components (LLC). Each HLC is associated with a serving zone and all LLC within this area are connected to the corresponding HLC. So-called sparse LLC networks, whe...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملA Stochastic Model for Multi-Hierarchical Networks
We provide a stochastic modelling approach for multi-hierarchical fixedaccess telecommunication networks where cables are installed along the underlying road system. It constitutes an extension of network models consisting of only two hierarchy levels. We consider the effects of the introduction of an additional level of hierarchy on two functionals relevant in telecommunication networks, namel...
متن کاملCockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013